A combinatorial proof for the enumeration of alternating permutations with given peak set
نویسنده
چکیده
Using the correspondence between alternating permutations and pairs of matchings, we present a combinatorial proof for the enumeration of alternating permutations with given peak set. Moreover, we give a refinement according to the number of left to right maxima.
منابع مشابه
Parity-alternating permutations and successions
The study of parity-alternating permutations of {1, 2, . . . , n} is extended to permutations containing a prescribed number of parity successions – adjacent pairs of elements of the same parity. Several enumeration formulae are computed for permutations containing a given number of parity successions, in conjunction with further parity and length restrictions. The objects are classified using ...
متن کاملA Combinatorial Proof for the Alternating Convolution of the Central Binomial Coefficients
We give a combinatorial proof of the identity for the alternating convolution of the central binomial coefficients. Our proof entails applying an involution to certain colored permutations and showing that only permutations containing cycles of even length remain. The combinatorial identity
متن کاملCombinatorial Statistics on Alternating Permutations
We consider two combinatorial statistics on permutations. One is the genus. The other, d̂es, is defined for alternating permutations, as the sum of the number of descents in the subwords formed by the peaks and the valleys. We investigate the distribution of d̂es on genus zero permutations and Baxter permutations. Our qenumerative results relate the d̂es statistic to lattice path enumeration, the ...
متن کاملThe Enumeration of Doubly Alternating Baxter Permutations
In this paper, we give an alternative proof that the number of doubly alternating Baxter permutations is Catalan.
متن کاملEnumeration of snakes and cycle-alternating permutations
Springer numbers are analogs of Euler numbers for the group of signed permutations. Arnol’d showed that they count some objects called snakes, which generalize alternating permutations. Hoffman established a link between Springer numbers, snakes, and some polynomials related with the successive derivatives of trigonometric functions. The goal of this article is to give further combinatorial pro...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
- Australasian J. Combinatorics
دوره 57 شماره
صفحات -
تاریخ انتشار 2013